FPGA Implementation of DLP-PHOTON Hash Function
نویسندگان
چکیده
منابع مشابه
Efficient FPGA Hardware Implementation of Secure Hash Function SHA-2
The Hash function has been studied by designers with the goal to improve its performances in terms of area, frequency and throughput. The Hash function is used in many embedded systems to provide security. It is become the default choice for security services in numerous applications. In this paper, we proposed a new design for the SHA-256 and SHA-512 functions. Moreover, the proposed design ha...
متن کاملImplementation of the Keccak Hash Function in FPGA Devices
Implementation setup The Keccak hardware reference designs consists of two rather different implementations. the high_speed_core design is, as the name suggest, a self contained high performance design. The low_area_copro on the other hand, is a small design where the state memory is external from the rest of the design. This allows the Keccak coprocessor to share memory with other design entit...
متن کاملFpga Implementation of Md5 Hash Algorithm
In information security, message authentication is an essential technique to verify that received messages come from the alleged source and have not been altered. A key element of authentication schemes is the use of a message authentication code (MAC). One technique to produce a MAC is based on using a hash function and is referred to as an HMAC. Message Digest 5 (MD5) is one of the algorithms...
متن کاملAn 80Gbps FPGA Implementation of a Universal Hash Function based Message Authentication Code
We developed an architecture optimization technique called divide-and-concatenate and applied it to a cryptographic message authentication code (MAC). This is based on two key observations: (i) The area of a multiplier and associated data path decreases quadratically and their speeds increase gradually as their operand size is reduced. (ii) Two w-bit universal hash function data paths (each wit...
متن کاملAn Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Future Generation Communication and Networking
سال: 2017
ISSN: 2233-7857,2233-7857
DOI: 10.14257/ijfgcn.2017.10.12.07